Hypercomputation, Frege, Deleuze: Solving Thomson's Lamp

نویسنده

  • Abhishek Bose-Kolanu
چکیده

We present the first known solution to the original supertask, the Thomson Lamp Paradox. Supertasks, or infinite operations, form an integral part of the emerging study of hypercomputation (computation in excess of classical Turing machine capabilities) and are of philosophical interest for the paradoxes they engender. We also offer preliminary resources for classifying computational complexity of various supertasks. In so doing we consider a newly apparent paradox between the metrical limit and the ordinal limit. We use this distinction between the metrical and ordinal limits to explain the shortcomings both of Thomson's original formulation of the Lamp Paradox and Benacerraf's consequent critique. We resolve this paradox through a careful consideration of transfinite ordinals and locate its ambiguity as inherent to the identity relation under logic with a close reading of Frege's Begriffsschrift. With this close reading in hand we expose how the identity relation is counter-intuitively polyvalent and, with supertasks, how the logico-mathematical field operates on the basis of Deleuzian point-folds. Our results combine resources from philosophy, mathematics, and computer science to ground the field of hypercomputation for logically rigorous study.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

" Thomson's Lamp Is Dysfunctional

James Thomson envisaged a lamp which would be turned on for 1 minute, off for 1/2 minute, on for 1/4 minute, etc. ad infinitum. He asked whether the lamp would be on or off at the end of 2 minutes. Use of “internal set theory” (a version of nonstandard analysis), developed by Edward Nelson, shows Thomson’s lamp is chimerical; its copy within set theory yields a contradiction. The demonstration ...

متن کامل

Non-Classical Hypercomputation

Hypercomputation that seeks to solve the Halting Problem, or to compute Turing-uncomputable numbers, might be called “classical” hypercomputation, as it moves beyond the classical Turing computational paradigm. There are further computational paradigms that we might seek to move beyond, forming the basis for a wider “non-classical” hypercomputation. This paper surveys those paradigms, and poses...

متن کامل

The case for hypercomputation

The weight of evidence supporting the case for hypercomputation is compelling. We examine some 20 physical and mathematical models of computation that are either known or suspected to have super-Turing or hypercomputational capabilities, and argue that there is nothing in principle to prevent the physical implementation of hypercomputational systems. Hypercomputation may indeed be intrinsic to ...

متن کامل

Hypercomputation: philosophical issues

A survey of the /eld of hypercomputation, including discussion of four a priori objections to the possibility of hypercomputation. An exegesis of Turing’s preand post-war writings on the mind is given, and Turing’s views on the scope of machines are discussed. c © 2003 Published by Elsevier B.V.

متن کامل

Existence of Faster than Light Signals Implies Hypercomputation already in Special Relativity

Within an axiomatic framework, we investigate the possibility of hypercomputation in special relativity via faster than light signals. We formally show that hypercomputation is theoretically possible in special relativity if and only if there are faster than light signals.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1503.05847  شماره 

صفحات  -

تاریخ انتشار 2015